Knapsack problem - PDFSEARCH.IO - Document Search Engine

Knapsack problem
Results: 111

#	Item
71	Approximation Algorithms for Correlated Knaspacks and Non-Martingale Bandits Anupam Gupta∗ Ravishankar Krishnaswamy∗ Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-02-14 10:17:58 Operations research Stochastic processes Dynamic programming Combinatorial optimization NP-complete problems Knapsack problem Multi-armed bandit Martingale Randomized rounding Statistics Theoretical computer science Applied mathematics
72	Improved Generic Algorithms for Hard Knapsacks? Anja Becker1,?? , Jean-S´ebastien Coron3 , and Antoine Joux1,2 1 University of Versailles Saint-Quentin-en-Yvelines 2 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2011-08-31 08:22:53 NP-complete problems Combinatorial optimization Cryptography Knapsack problem Operations research Theoretical computer science Applied mathematics Dynamic programming
73	Math. Program., Ser. A[removed]:19–41 DOI[removed]s10107[removed]FULL LENGTH PAPER On the exact separation of mixed integer knapsack cuts Ricardo Fukasawa · Marcos Goycoolea Add to Reading List Source URL: mgoycool.uai.cl Language: English - Date: 2011-10-28 12:33:42 Combinatorial optimization Operations research NP-complete problems Dynamic programming Cryptography Knapsack problem Cutting-plane method Linear programming relaxation Optimization problem Theoretical computer science Mathematical optimization Applied mathematics
74	On the Exact Separation of Mixed Integer Knapsack Cuts Ricardo Fukasawa1 and Marcos Goycoolea2 1 H. Milton Stewart School of Industrial and Systems Engineering Add to Reading List Source URL: mgoycool.uai.cl Language: English - Date: 2008-04-11 12:49:59 Theoretical computer science Combinatorial optimization Knapsack problem Cutting-plane method Linear programming relaxation Linear programming Simplex algorithm Dynamic programming Mathematical optimization Operations research Applied mathematics
75	The precedence constrained knapsack problem: Separating maximally violated inequalities. Daniel Espinoza Department of Industrial Engineering, Universidad de Chile Marcos Goycoolea School of Business, Universidad Adolfo Add to Reading List Source URL: mgoycool.uai.cl Language: English - Date: 2012-12-05 08:27:12 Inequality Applied mathematics Combinatory logic Linear programming Cauchy–Schwarz inequality Mathematics Theoretical computer science Elementary algebra
76	The Math Forum: Problems of the Week Problem Solving and Communication Activity Series Round 18: Change the Representation All math problems, whether they are word problems, arithmetic problems, equations to solve, etc. Add to Reading List Source URL: mathforum.org Language: English - Date: 2014-02-28 13:47:59 Ordinary differential equations Mathematics education Multiple representations XTR Differential equation Operations research Linear algebra N-body problem Knapsack problem Mathematics Algebra Mathematical analysis
77	Adaptive Pricing for Customers with Probabilistic Valuations Michael Benisch, James Andrews and Norman Sadeh School of Computer Science, Carnegie Mellon University Abstract. In this paper, we examine the problem of choo Add to Reading List Source URL: jimmylands.com Language: English - Date: 2013-12-07 17:24:09 Applied mathematics Operations research Marketing Pricing NP-complete problems Continuous knapsack problem Knapsack problem Optimization problem Price Theoretical computer science Computational complexity theory Combinatorial optimization
78	Sage Reference Manual: Numerical Optimization Release 6.3 The Sage Development Team Add to Reading List Source URL: www.sagemath.org Language: English - Date: 2014-11-16 14:58:22 Operations research Dynamic programming Cryptography Combinatorial optimization Knapsack problem Subset sum problem Sequence Superincreasing sequence Exponentiation Mathematics Theoretical computer science Computational complexity theory
79	310 TUGboat, Volume[removed]), No. 3 Macros Fast and secure multiple-option tests Add to Reading List Source URL: www.tug.org Language: English - Date: 1998-03-13 09:09:58 Combinatorial optimization Cryptography Dynamic programming Knapsack problem Operations research TeX Prime number Euclidean algorithm ALGOL 68 Theoretical computer science Mathematics Applied mathematics
80	310 TUGboat, Volume[removed]), No. 3 Macros Fast and secure multiple-option tests Add to Reading List Source URL: tug.org Language: English - Date: 1998-03-13 09:09:58 Combinatorial optimization Cryptography Dynamic programming Knapsack problem Operations research TeX Prime number Euclidean algorithm ALGOL 68 Theoretical computer science Mathematics Applied mathematics